Application in Emergency Vehicle Routing Choosing of Particle Swarm Optimization Based Ant Colony Algorithm
نویسندگان
چکیده
With the speeding up of urbanization in our country, the situation of urban emergency is getting more and more serious; therefore, it is necessary to promote the study in urban emergency management, so as to enhance the city ability of resisting the emergency. Based on the defects of the emergency vehicle routing choosing, the paper puts forward a particle swarm optimization based ant colony algorithm. The algorithm uses particle swarm algorithm to optimize the important parameter of ant colony system, making the parameters of the ant colony system unnecessary to be obtained by artificial experience or cut-and-trial method, but adaptively select by particle searching, which optimizes the defects of long searching time and easily to be premature or stagnation of the basic ant colony algorithm. Algorithm simulation results show that the particle swarm optimization based ant colony algorithm is good in searching for the optimal solution, and which has a short search time, a good convergence performance, and which is not easily into the local optimum, its performance is better than the basic ant colony algorithm.
منابع مشابه
Solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملA Review of Bio-inspired Algorithms for Vehicle Routing
This chapter reviews biologically inspired algorithms for solving a class of difficult combinatorial optimization problems known as vehicle routing problems, where least cost collection or delivery routes are designed to serve a set of customers in a transportation network. From a methodological standpoint, the review includes evolutionary algorithms, ant colony optimization, particle swarm opt...
متن کاملA Hybrid Algorithm Based on ACO and PSO for Capacitated Vehicle Routing Problems
The vehicle routing problem VRP is a well-known combinatorial optimization problem. It has been studied for several decades because finding effective vehicle routes is an important issue of logistic management. This paper proposes a new hybrid algorithm based on two main swarm intelligence SI approaches, ant colony optimization ACO and particle swarm optimization PSO , for solving capacitated v...
متن کاملRelevance of Artificial Bee Colony Algorithm over Other Swarm Intelligence Algorithms
A new population-based search algorithm called the Bees Algorithm (BA) is presented in this paper. The algorithm mimics the food foraging behavior of swarms of honey bees. This algorithm performs a kind of neighborhood search combined with random search and can be used for both combinatorial optimization and functional optimization and with good numerical optimization results. ABC is a meta-heu...
متن کاملSolving the vehicle routing problem by a hybrid meta-heuristic algorithm
The vehicle routing problem (VRP) is one of the most important combinational optimization problems that has nowadays received much attention because of its real application in industrial and service problems. The VRP involves routing a fleet of vehicles, each of them visiting a set of nodes such that every node is visited by exactly one vehicle only once. So, the objective is to minimize the to...
متن کامل